A Distributed Survivable Routing Algorithm for Mega-Constellations With Inclined Orbits
نویسندگان
چکیده
منابع مشابه
Invariant relative orbits for satellite constellations: A second order theory
Working with the mean orbit elements, the secular drift of the longitude of the ascending node and the sum of the argument of perigee and mean anomaly are set equal between two neighboring orbits. By having both orbits drift at equal angular rates on the average, they will not separate over time due to the influence of the perturbative effects of the asphericity of the Earth, as is considered i...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملSurvivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc weights assigned by the network operator. Each router computes shortest paths and creates destination tables used for routing flow on the shortest paths. If a router has multiple outgoing links on shortest paths to a g...
متن کاملPower Aware with the Survivable Routing Algorithm for Mobile Ad Hoc Networks
The mobile ad hoc networks are gaining importance because of their versatility, mobility and ability to work with a limited infrastructure. In the mobile ad hoc network, each node works as a router as well as host. It is generally decentralized network, where all network activities include route discovery and message delivery must be executed by the nodes themselves. In this paper, we present a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3041346